A hybrid of ant colony optimization and minimization of metabolic adjustment to improve the production of succinic acid in Escherichia coli

نویسندگان

  • Shiue Kee Chong
  • Mohd Saberi Mohamad
  • Abdul Hakim Mohamed Salleh
  • Yee Wen Choon
  • Chuii Khim Chong
  • Safaai Deris
چکیده

This paper presents a study on gene knockout strategies to identify candidate genes to be knocked out for improving the production of succinic acid in Escherichia coli. Succinic acid is widely used as a precursor for many chemicals, for example production of antibiotics, therapeutic proteins and food. However, the chemical syntheses of succinic acid using the traditional methods usually result in the production that is far below their theoretical maximums. In silico gene knockout strategies are commonly implemented to delete the gene in E. coli to overcome this problem. In this paper, a hybrid of Ant Colony Optimization (ACO) and Minimization of Metabolic Adjustment (MoMA) is proposed to identify gene knockout strategies to improve the production of succinic acid in E. coli. As a result, the hybrid algorithm generated a list of knockout genes, succinic acid production rate and growth rate for E. coli after gene knockout. The results of the hybrid algorithm were compared with the previous methods, OptKnock and MOMAKnock. It was found that the hybrid algorithm performed better than OptKnock and MOMAKnock in terms of the production rate. The information from the results produced from the hybrid algorithm can be used in wet laboratory experiments to increase the production of succinic acid in E. coli.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Hybrid of Harmony Search and Minimization of Metabolic Adjustment for Optimization of Succinic Acid Production

Succinic acid has been favored by researchers due to its industrial multi-uses. However, the production of succinic acid is far below cell theoretical maximum. The goal of this research is to identify the optimal set of gene knockouts for obtaining high production of succinic acid in microorganisms. Gene knockout is a widely used genetic engineering technique. Hence, a hybrid of Harmony Search ...

متن کامل

An Ant Colony Optimization Algorithm for Network Vulnerability Analysis

Intruders often combine exploits against multiple vulnerabilities in order to break into the system. Each attack scenario is a sequence of exploits launched by an intruder that leads to an undesirable state such as access to a database, service disruption, etc. The collection of possible attack scenarios in a computer network can be represented by a directed graph, called network attack gra...

متن کامل

A hybridization of evolutionary fuzzy systems and ant Colony optimization for intrusion detection

A hybrid approach for intrusion detection in computer networks is presented in this paper. The proposed approach combines an evolutionary-based fuzzy system with an Ant Colony Optimization procedure to generate high-quality fuzzy-classification rules. We applied our hybrid learning approach to network security and validated it using the DARPA KDD-Cup99 benchmark data set. The results indicate t...

متن کامل

A hybrid ant colony optimization algorithm to optimize capacitated lot-sizing problem

The economical determination of lot size with capacity constraints is a frequently complex, problem in the real world. In this paper, a multi-level problem of lotsizing with capacity constraints in a finite planning horizon is investigated. A combination of ant colony algorithm and a heuristic method called shifting technique is proposed for solving the problem. The parameters, including the co...

متن کامل

Winner Determination in Combinatorial Auctions using Hybrid Ant Colony Optimization and Multi-Neighborhood Local Search

A combinatorial auction is an auction where the bidders have the choice to bid on bundles of items. The WDP in combinatorial auctions is the problem of finding winning bids that maximize the auctioneer’s revenue under the constraint that each item can be allocated to at most one bidder. The WDP is known as an NP-hard problem with practical applications like electronic commerce, production manag...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Computers in biology and medicine

دوره 49  شماره 

صفحات  -

تاریخ انتشار 2014